How To Tame Your Sparsity Constraints
نویسنده
چکیده
We show that designing sparse H∞ controllers, in a discrete (LTI) setting, is easy when the controller is assumed to be an FIR filter. In this case, the problem reduces to a static output feedback problem with equality constraints. We show how to obtain an initial guess, for the controller, and then provide a simple algorithm that alternates between two (convex) feasibility programs until converging, when the problem is feasible, to a suboptimal H∞ controller that is automatically stable. As FIR filters contain the information of their impulse response in their coefficients, it is easy to see that our results provide a path of least resistance to designing sparse robust controllers for continuous-time plants, via system identification methods.
منابع مشابه
P14: How to Find a Talent?
Talents may be artistic or technical, mental or physical, personal or social. You can be a talented introvert or a talented extrovert. Learning to look for your talents in the right places and building those talents into skills and abilities might take some work, but going about it creatively will let you explore your natural abilities and find your innate talents. You’re not going to fin...
متن کاملTaming math and physics using SymPy
Most people consider math and physics to be scary beasts from which it is best to keep one’s distance. Computers, however, can help us tame the complexity and tedious arithmetic manipulations associated with these subjects. Indeed, math and physics are much more approachable once you have the power of computers on your side. This tutorial serves a dual purpose. On one hand, it serves as a revie...
متن کامل3D Inversion of Magnetic Data through Wavelet based Regularization Method
This study deals with the 3D recovering of magnetic susceptibility model by incorporating the sparsity-based constraints in the inversion algorithm. For this purpose, the area under prospect was divided into a large number of rectangular prisms in a mesh with unknown susceptibilities. Tikhonov cost functions with two sparsity functions were used to recover the smooth parts as well as the sharp ...
متن کاملTame Flows
The tame flows are “nice” flows on “nice” spaces. The nice (tame) sets are the pfaffian sets introduced by Khovanski, and a flow Φ : R×X → X on pfaffian set X is tame if the graph of Φ is a pfaffian subset of R×X×X . Any compact tame set admits plenty tame flows. We prove that the flow determined by the gradient of a generic real analytic function with respect to a generic real analytic metric ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1506.00300 شماره
صفحات -
تاریخ انتشار 2015